Mixed Integer Linear Programming Models to Solve a Real-Life Vehicle Routing Problem with Pickup and Delivery

This paper presents multiple readings to solve a vehicle routing problem with pickup and delivery (VRPPD) based on real-life case study. Compared theoretical problems, ones are more difficult address due their richness complexity. To handle points of view in modeling our problem, we developed three different Mixed Integer Linear Programming (MILP) models, where each model covers particular constraints. The suggested models designed for mega poultry company Tunisia, called CHAHIA. Our mission was develop prototype CHAHIA that helps decision-makers find the best path simultaneously delivering company’s products collecting empty boxes. Based data provided by CHAHIA, conducted computational experiments, which have shown interesting promising results.